Moufang loops of odd prime exponent p and a class of linear spaces of order p
نویسندگان
چکیده
منابع مشابه
Moufang Loops of Odd Order p 21 p 2 2 · · · p 2 n q 3
It has been shown that for distinct odd primes p1, p2, . . . , pn and q, all Moufang loops of order p1p2 · · · pnq are groups if and only if q is not congruent to 1 modulo pi for each i. In this paper, we extend that result to include Moufang loops of order p1p 2 2 · · · pnq. Mathematics Subject Classification: 20N05
متن کاملsome properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولgroups of order $p^8$ and exponent $p$
we prove that for $p>7$ there are [ p^{4}+2p^{3}+20p^{2}+147p+(3p+29)gcd (p-1,3)+5gcd (p-1,4)+1246 ] groups of order $p^{8}$ with exponent $p$. if $p$ is a group of order $p^{8}$ and exponent $p$, and if $p$ has class $c>1$ then $p$ is a descendant of $p/gamma _{c}(p)$. for each group of exponent $p$ with order less than $p^{8} $ we calculate the number of descendants of o...
متن کاملMoufang Loops of Order 2 m , m odd
We first show that every Moufang loop L which contains an abelian associative subloop M of index two and odd order must, in fact, be a group. We then use this to settle the question ”For what value of n = 2m, m odd, must a Moufang loop of order n be associative?” Introduction: This paper is motivated by a question asked by Rajah and Jamal in [19]: If L is a Moufang loop of order 2m with an abel...
متن کاملexistence and approximate $l^{p}$ and continuous solution of nonlinear integral equations of the hammerstein and volterra types
بسیاری از پدیده ها در جهان ما اساساً غیرخطی هستند، و توسط معادلات غیرخطی بیان شده اند. از آنجا که ظهور کامپیوترهای رقمی با عملکرد بالا، حل مسایل خطی را آسان تر می کند. با این حال، به طور کلی به دست آوردن جوابهای دقیق از مسایل غیرخطی دشوار است. روش عددی، به طور کلی محاسبه پیچیده مسایل غیرخطی را اداره می کند. با این حال، دادن نقاط به یک منحنی و به دست آوردن منحنی کامل که اغلب پرهزینه و ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1982
ISSN: 0097-3165
DOI: 10.1016/0097-3165(82)90050-4